On Parallel Graph Rewriting Systems

Parallel Graph Rewriting Systems

Parallel Admissible Graph Rewriting

We investigate the rewrite relation over graphs induced by constructor-based weakly orthogonal graph rewriting systems. It is well known that this relation is not confluent in general whereas it is confluent in the case of weakly orthogonal term rewriting systems. We show, however, that the considered relation is always confluent, as well as confluent modulo bisimilarity, for a large class of g...

Term Graph Rewriting and Parallel Term Rewriting

The relationship between Term Graph Rewriting and Term Rewriting is well understood: a single term graph reduction may correspond to several term reductions, due to sharing. It is also known that if term graphs are allowed to contain cycles, then one term graph reduction may correspond to infinitely many term reductions. We stress that this fact can be interpreted in two ways. According to the ...

Blind graph rewriting systems

We consider a simple (probably, the simplest) structure for random access memory. This structure can be used to construct a universal system with nearly void processor, namely, we demonstrate that the processor of such a system may have empty instruction set, in a more strong manner than the existing ZISC (zero instruction set computer based on ideas for artificial neural networks) and NISC arc...

Strategic programming on graph rewriting systems

Rewriting [4] is a computation model used in computer science, algebra, logic and linguistics, amongst others. Its purpose is to transform syntactic objects (words, terms, programs, proofs, graphs, etc., which we will call generally expressions), by applying rewrite rules until a suitable simplied form is obtained. Given an expression and a set of rewrite rules, it is often the case that severa...